Embedding between Hypercube and HCN(n, n), HFN(n, n)
نویسندگان
چکیده
منابع مشابه
$n$-cocoherent rings, $n$-cosemihereditary rings and $n$-V-rings
Let $R$ be a ring, and let $n, d$ be non-negative integers. A right $R$-module $M$ is called $(n, d)$-projective if $Ext^{d+1}_R(M, A)=0$ for every $n$-copresented right $R$-module $A$. $R$ is called right $n$-cocoherent if every $n$-copresented right $R$-module is $(n+1)$-coprese-nted, it is called a right co-$(n,d)$-ring if every right $R$-module is $(n, d)$-projective. $R$...
متن کاملFixed Hypercube Embedding
In this paper, we consider the problem of embedding a given graph into a fixed-size hypercube. This work is related to other recent research on hypercube embedding. In [1], Bhat describes an order IVl log2 IVI algorithm for testing whether a given graph G = (V, E) is exactly an n-cube. Deciding whether a graph has a distance-preserving embedding into a hypercube can be done in polynomial time [...
متن کاملMNDO Study of Nitrogen Atom Inversion in Piperazine, N,N'-Dimethylpiperazine and N,N'-Dichloropiperazine
MNDO semi-empirical SCF MO calculations are used to study the pyramidal nitrogen atom inversion and configurational equilibria in the title compounds.
متن کاملLabeled embedding of (n, n-2)-graphs in their complements
21 Graph packing generally deals with unlabeled graphs. In [4], the authors 22 have introduced a new variant of the graph packing problem, called the 23 labeled packing of a graph. This problem has recently been studied on trees 24 [6] and cycles [4]. In this note, we present a lower bound on the labeled 25 packing number of any (n, n − 2)-graph into Kn. This result improves the 26 bound given ...
متن کاملEmbedding of Hypercube into Cylinder
Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hyp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2002
ISSN: 1598-2831
DOI: 10.3745/kipsta.2002.9a.2.191